Pruning in multi-motion model based skip and direct mode coded video blocks

ABSTRACT

Methods, systems and devices for applying pruning in multi-motion model based skip and direct mode coded video blocks are described. An exemplary method for video processing includes applying, to a candidate list for a video block, a pruning operation between a candidate in a first set of candidates derived from previously coded blocks in a decoding order and a candidate in a second set of candidates, and performing, based on the candidate list subsequent to applying the pruning operation, a conversion between the video block and a bitstream representation of the video block.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of International Application No.PCT/IB2019/057144, filed on Aug. 26, 2019, which claims the priority toand benefits of International Patent Applications No. PCT/CN2018/102370filed on Aug. 26, 2018. All the aforementioned patent applications arehereby incorporated by reference in their entireties.

TECHNICAL FIELD

This document is related to video coding technologies.

BACKGROUND

Digital video accounts for the largest bandwidth use on the internet andother digital communication networks. As the number of connected userdevices capable of receiving and displaying video increases, it isexpected that the bandwidth demand for digital video usage will continueto grow.

SUMMARY

The disclosed techniques may be used by video decoder or encoderembodiments in which pruning is applied in multi-motion model based skipand direct mode coded video blocks.

In one example aspect, a method for video processing is disclosed. Themethod includes applying, to a candidate list for a video block, apruning operation between a candidate in a first set of candidatesderived from previously coded blocks in a decoding order and a candidatein a second set of candidates; and performing, based on the candidatelist subsequent to applying the pruning operation, a conversion betweenthe video block and a bitstream representation of the video block.

In another example aspect, a method for video processing is disclosed.The method includes applying, to a candidate list for a video block, apruning operation between a first set of candidates comprisingcandidates from spatially or temporally non-adjacent blocks and a secondset of candidates comprising candidates derived from a multi-motionmodel based skip mode or direct mode design; and performing, based onthe candidate list subsequent to applying the pruning operation, aconversion between the video block and a bitstream representation of thevideo block.

In yet another example aspect, a method for video processing isdisclosed. The method includes refraining from applying a pruningoperation to a candidate list for a video block, the candidate listcomprising a plurality of candidates derived from a multi-motion modelbased skip mode or direct mode design, and each of the plurality ofcandidates being based on a motion model-matched search or a defaultmotion vector (MV) construction process; and performing, based on thecandidate list, a conversion between the video block and a bitstreamrepresentation of the video block.

In some embodiments, the methods may preferably include the second setof candidates comprising candidates from spatially or temporallynon-adjacent blocks.

In some embodiments, the methods may preferably include the pruningoperation inserting a first candidate to the candidate list andexcluding a second candidate from the candidate list.

In some embodiments, the methods may preferably include the firstcandidate being identical to the second candidate.

In some embodiments, the methods may preferably include a motion vectordifference between the first candidate and the second candidate beingless than a threshold.

In some embodiments, the methods may preferably include the second setof candidates comprising candidates derived from a multi-motion modelbased skip mode or direct mode design.

In some embodiments, the methods may preferably include the candidate inthe second set of candidates being based on a motion model-matchedsearch.

In some embodiments, the methods may preferably include the candidate inthe second set of candidates being based on a default motion vector (MV)construction process.

In some embodiments, the methods may preferably include the candidate inthe first set of candidates being a history-based motion vectorprediction (HMVP) candidate in a table.

In some embodiments, the methods may preferably include the candidate inthe second set of candidates being derived from spatial or temporalneighboring blocks in a motion model-matched search, and the candidatein the first set of candidates being a history-based motion vectorprediction (HMVP) candidate.

In some embodiments, the methods may preferably include the candidate inthe second set of candidates being derived from spatial or temporalneighboring blocks in a motion model-matched search, an artificialsearch or a default motion vector construction process, and thecandidate in the first set of candidates being a history-based motionvector prediction (HMVP) candidate.

In some embodiments, the methods may preferably include the candidatelist being constructed with motion candidates derived from spatial ortemporal neighboring blocks and history-based motion vector prediction(HMVP) candidates, with pruning operations.

In some embodiments, the methods may preferably include the HMVPcandidates being derived from previously decoded video blocks that aredecoded prior to the video block.

In some embodiments, the methods may preferably include performing theconversion comprising generating the bitstream representation from thevideo block.

In some embodiments, the methods may preferably include performing theconversion comprising generating the video block from the bitstreamrepresentation.

In some embodiments, the methods may preferably include the candidate inthe first set of candidates being associated with motion informationcomprising at least one of a prediction direction, a reference pictureindex, a motion vector value, an intensity compensation flag, an affineflag, a motion vector difference precision or motion vector differencevalue.

In some embodiments, the methods may preferably include the step ofupdating, based on performing the conversion, the first set ofcandidates.

In some embodiments, the methods may preferably include updating thefirst set of candidates comprising updating, subsequent to performingthe conversion, the first set of candidates based on motion informationof the video block.

In some embodiments, the methods may preferably include the step ofperforming, subsequent to updating the first set of candidates, aconversion between a subsequent video block of a video and a bitstreamrepresentation of the video based on the first set of candidates.

In some embodiments, the methods may preferably include the pruningoperation being applied between candidates associated with a same motionmodel.

In yet another example aspect, the above-described method may beimplemented by a video decoder apparatus that comprises a processor.

In yet another example aspect, the above-described method may beimplemented by a video encoder apparatus that comprises a processor.

In yet another example aspect, these methods may be embodied in the formof processor-executable instructions and stored on a computer-readableprogram medium.

These, and other, aspects are further described in the present document.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is an illustration of MB partitions in H.264/Advanced VideoCoding (AVC).

FIG. 2 shows examples of modes for splitting a coding block (CB) intoprediction blocks (PBs).

FIG. 3 shows an example of subdivision of a coding tree block (CTB) intoCBs.

FIG. 4 shows an example of a derivation process for merge candidateslist construction.

FIG. 5 shows an example of positions of spatial merge candidates.

FIG. 6 shows an example of candidate pairs considered for redundancycheck of spatial merge candidates.

FIG. 7 shows examples of positions for a second prediction unit (PU) ofN×2N and 2N×N partitions.

FIG. 8 shows an example of a motion vector scaling for temporal mergecandidates.

FIG. 9 shows an example of candidate positions for temporal mergecandidates in a co-located picture.

FIG. 10 shows an example of a combined bi-predictive merge candidate.

FIG. 11 shows an example of a derivation process for motion vectorprediction candidates.

FIG. 12 shows an example of motion vector scaling for a spatial motionvector candidate.

FIGS. 13A and 13B show examples of possible recursive CU/PU structures.

FIG. 14 shows an example of a current block and its neighboring blocksused in AVS3.

FIG. 15 is a block diagram of an example of a video processingapparatus.

FIG. 16 shows a block diagram of an example implementation of a videoencoder.

FIG. 17 is a block diagram of an example video processing system inwhich disclosed techniques may be implemented.

FIGS. 18A-18C are flowcharts for examples of video processing methods.

DETAILED DESCRIPTION

The present document provides various techniques that can be used by adecoder of video bitstreams to improve the quality of decompressed ordecoded digital video. Furthermore, a video encoder may also implementthese techniques during the process of encoding in order to reconstructdecoded frames used for further encoding.

Section headings are used in the present document for ease ofunderstanding and do not limit the embodiments and techniques to thecorresponding sections. As such, embodiments from one section can becombined with embodiments from other sections.

1. Summary

This patent document is related to video coding technologies.Specifically, it is related to motion vector coding in image/videocoding. It may be applied to the existing video coding standard likeHEVC, or the standard (Versatile Video Coding), third generation of theChinese Audio and Video coding Standard (AVS3) to be finalized. It maybe also applicable to future video coding standards or video codec.

2. Background

Video coding standards have evolved primarily through the development ofthe well-known ITU-T and ISO/IEC standards. The ITU-T produced H.261 andH.263, ISO/IEC produced MPEG-1 and MPEG-4 Visual, and the twoorganizations jointly produced the H.262/MPEG-2 Video and H.264/MPEG-4Advanced Video Coding (AVC) and H.265/HEVC standards. Since H.262, thevideo coding standards are based on the hybrid video coding structurewherein temporal prediction plus transform coding are utilized.

Partition Structure

Partition Tree Structure in H.264/AVC

The core of the coding layer in previous standards was the macroblock,containing a 16×16 block of luma samples and, in the usual case of 4:2:0color sampling, two corresponding 8×8 blocks of chroma samples.

An intra-coded block uses spatial prediction to exploit spatialcorrelation among pixels. Two partitions are defined: 16×16 and 4×4.

An inter-coded block uses temporal prediction, instead of spatialprediction, by estimating motion among pictures. Motion can be estimatedindependently for either 16×16 macroblock or any of its sub-macroblockpartitions: 16×8, 8×16, 8×8, 8×4, 4×8, 4×4 (see FIG. 2 ). Only onemotion vector (MV) per sub-macroblock partition is allowed.

FIG. 1 is an illustration of MB partitions in H.264/Advanced VideoCoding (AVC).

2.1.2 Partition Tree Structure in HEVC

In HEVC, a CTU is split into CUs by using a quadtree structure denotedas coding tree to adapt to various local characteristics. The decisionwhether to code a picture area using inter-picture (temporal) orintra-picture (spatial) prediction is made at the CU level. Each CU canbe further split into one, two or four PUs according to the PU splittingtype. Inside one PU, the same prediction process is applied and therelevant information is transmitted to the decoder on a PU basis. Afterobtaining the residual block by applying the prediction process based onthe PU splitting type, a CU can be partitioned into transform units(TUs) according to another quadtree structure similar to the coding treefor the CU. One of key feature of the HEVC structure is that it has themultiple partition conceptions including CU, PU, and TU.

In the following, the various features involved in hybrid video codingusing HEVC are highlighted as follows.

1) Coding tree units and coding tree block (CTB) structure: Theanalogous structure in HEVC is the coding tree unit (CTU), which has asize selected by the encoder and can be larger than a traditionalmacroblock. The CTU consists of a luma CTB and the corresponding chromaCTBs and syntax elements. The size L×L of a luma CTB can be chosen asL=16, 32, or 64 samples, with the larger sizes typically enabling bettercompression. HEVC then supports a partitioning of the CTBs into smallerblocks using a tree structure and quadtree-like signaling.

2) Coding units (CUs) and coding blocks (CBs): The quadtree syntax ofthe CTU specifies the size and positions of its luma and chroma CBs. Theroot of the quadtree is associated with the CTU. Hence, the size of theluma CTB is the largest supported size for a luma CB. The splitting of aCTU into luma and chroma CBs is signaled jointly. One luma CB andordinarily two chroma CBs, together with associated syntax, form acoding unit (CU). A CTB may contain only one CU or may be split to formmultiple CUs, and each CU has an associated partitioning into predictionunits (PUs) and a tree of transform units (TUs).

3) Prediction units and prediction blocks (PBs): The decision whether tocode a picture area using inter picture or intra picture prediction ismade at the CU level. A PU partitioning structure has its root at the CUlevel. Depending on the basic prediction-type decision, the luma andchroma CBs can then be further split in size and predicted from luma andchroma prediction blocks (PBs). HEVC supports variable PB sizes from64×64 down to 4×4 samples. FIG. 2 shows examples of allowed PBs for aM×M CU.

FIG. 2 shows examples of modes for splitting a coding block (CB) intoprediction blocks (PBs). Modes for splitting a CB into PBs, subject tocertain size constraints. For intrapicture-predicted CBs, only M×M andM/2×M/2 are supported.

4) TUs and transform blocks: The prediction residual is coded usingblock transforms. A TU tree structure has its root at the CU level. Theluma CB residual may be identical to the luma transform block (TB) ormay be further split into smaller luma TBs. The same applies to thechroma TBs. Integer basis functions similar to those of a discretecosine transform (DCT) are defined for the square TB sizes 4×4, 8×8,16×16, and 32×32. For the 4×4 transform of luma intra picture predictionresiduals, an integer transform derived from a form of discrete sinetransform (DST) is alternatively specified.

FIG. 3 shows an example of subdivision of a coding tree block (CTB) intoCBs. Subdivision of a CTB into CBs [and transform block (TBs)]. Solidlines indicate CB borders and dotted lines indicate TB borders. (a) CTBwith its partitioning. (b) corresponding quadtree.

2.1.2.1 Tree-Structured Partitioning into Transform Blocks and Units

For residual coding, a CB can be recursively partitioned into transformblocks (TBs). The partitioning is signaled by a residual quadtree. Onlysquare CB and TB partitioning is specified, where a block can berecursively split into quadrants, as illustrated in FIG. 3 . For a givenluma CB of size M×M, a flag signals whether it is split into four blocksof size M/2×M/2. If further splitting is possible, as signaled by amaximum depth of the residual quadtree indicated in the SPS, eachquadrant is assigned a flag that indicates whether it is split into fourquadrants. The leaf node blocks resulting from the residual quadtree arethe transform blocks that are further processed by transform coding. Theencoder indicates the maximum and minimum luma TB sizes that it willuse. Splitting is implicit when the CB size is larger than the maximumTB size. Not splitting is implicit when splitting would result in a lumaTB size smaller than the indicated minimum. The chroma TB size is halfthe luma TB size in each dimension, except when the luma TB size is 4×4,in which case a single 4×4 chroma TB is used for the region covered byfour 4×4 luma TBs. In the case of intra-picture-predicted CUs, thedecoded samples of the nearest-neighboring TBs (within or outside theCB) are used as reference data for intra picture prediction.

In contrast to previous standards, the HEVC design allows a TB to spanacross multiple PBs for inter-picture predicted CUs to maximize thepotential coding efficiency benefits of the quadtree-structured TBpartitioning.

2.1.2.2 Parent and Child Nodes

A CTB is divided according to a quad-tree structure, the nodes of whichare coding units. The plurality of nodes in a quad-tree structureincludes leaf nodes and non-leaf nodes. The leaf nodes have no childnodes in the tree structure (i.e., the leaf nodes are not furthersplit). The, non-leaf nodes include a root node of the tree structure.The root node corresponds to an initial video block of the video data(e.g., a CTB). For each respective non-root node of the plurality ofnodes, the respective non-root node corresponds to a video block that isa sub-block of a video block corresponding to a parent node in the treestructure of the respective non-root node. Each respective non-leaf nodeof the plurality of non-leaf nodes has one or more child nodes in thetree structure.

2.2 Inter Prediction in HEVC/H.265

Each inter-predicted PU has motion parameters for one or two referencepicture lists. Motion parameters include a motion vector and a referencepicture index. Usage of one of the two reference picture lists may alsobe signalled using inter_pred_idc. Motion vectors may be explicitlycoded as deltas relative to predictors, such a coding mode is calledAMVP mode.

When a CU is coded with skip mode, one PU is associated with the CU, andthere are no significant residual coefficients, no coded motion vectordelta or reference picture index. A merge mode is specified whereby themotion parameters for the current PU are obtained from neighbouring PUs,including spatial and temporal candidates. The merge mode can be appliedto any inter-predicted PU, not only for skip mode. The alternative tomerge mode is the explicit transmission of motion parameters, wheremotion vector, corresponding reference picture index for each referencepicture list and reference picture list usage are signalled explicitlyper each PU.

When signalling indicates that one of the two reference picture lists isto be used, the PU is produced from one block of samples. This isreferred to as ‘uni-prediction’. Uni-prediction is available both forP-slices and B-slices.

When signalling indicates that both of the reference picture lists areto be used, the PU is produced from two blocks of samples. This isreferred to as ‘bi-prediction’. Bi-prediction is available for B-slicesonly.

The following text provides the details on the inter prediction modesspecified in the existing HEVC implementation.

2.2.1 Merge Mode

2.2.1.1 Derivation of Candidates for Merge Mode

When a PU is predicted using merge mode, an index pointing to an entryin the merge candidates list is parsed from the bitstream and used toretrieve the motion information. The construction of this list isspecified in the HEVC standard and can be summarized according to thefollowing sequence of steps:

-   -   Step 1: Initial candidates derivation    -   Step 1.1: Spatial candidates derivation    -   Step 1.2: Redundancy check for spatial candidates    -   Step 1.3: Temporal candidates derivation    -   Step 2: Additional candidates insertion    -   Step 2.1: Creation of bi-predictive candidates    -   Step 2.2: Insertion of zero motion candidates

These steps are also schematically depicted in FIG. 4 . For spatialmerge candidate derivation, a maximum of four merge candidates areselected among candidates that are located in five different positions.For temporal merge candidate derivation, a maximum of one mergecandidate is selected among two candidates. Since constant number ofcandidates for each PU is assumed at decoder, additional candidates aregenerated when the number of candidates does not reach to maximum numberof merge candidate (MaxNumMergeCand) which is signalled in slice header.Since the number of candidates is constant, index of best mergecandidate is encoded using truncated unary binarization (TU). If thesize of CU is equal to 8, all the PUs of the current CU share a singlemerge candidate list, which is identical to the merge candidate list ofthe 2N×2N prediction unit.

In the following, the operations associated with the aforementionedsteps are detailed.

2.2.1.2 Spatial Candidates Derivation

In the derivation of spatial merge candidates, a maximum of four mergecandidates are selected among candidates located in the positionsdepicted in FIG. 5 . The order of derivation is A₁, B₁, B₀, A₀ and B₂.Position B₂ is considered only when any PU of position A₁, B₁, B₀, A₀ isnot available (e.g. because it belongs to another slice or tile) or isintra coded. After candidate at position A₁ is added, the addition ofthe remaining candidates is subject to a redundancy check which ensuresthat candidates with same motion information are excluded from the listso that coding efficiency is improved. To reduce computationalcomplexity, not all possible candidate pairs are considered in thementioned redundancy check. Instead only the pairs linked with an arrowin FIG. 6 are considered and a candidate is only added to the list ifthe corresponding candidate used for redundancy check has not the samemotion information. Another source of duplicate motion information isthe “second PU” associated with partitions different from 2N×2N. As anexample, FIG. 7 depicts the second PU for the case of N×2N and 2N×N,respectively. When the current PU is partitioned as N×2N, candidate atposition A₁ is not considered for list construction. In fact, by addingthis candidate will lead to two prediction units having the same motioninformation, which is redundant to just have one PU in a coding unit.Similarly, position B₁ is not considered when the current PU ispartitioned as 2N×N.

2.2.1.3 Temporal Candidate Derivation

In this step, only one candidate is added to the list. Particularly, inthe derivation of this temporal merge candidate, a scaled motion vectoris derived based on co-located PU belonging to the picture which has thesmallest POC difference with current picture within the given referencepicture list. The reference picture list to be used for derivation ofthe co-located PU is explicitly signalled in the slice header. Thescaled motion vector for temporal merge candidate is obtained asillustrated by the dotted line in 13, which is scaled from the motionvector of the co-located PU using the POC distances, tb and td, where tbis defined to be the POC difference between the reference picture of thecurrent picture and the current picture and td is defined to be the POCdifference between the reference picture of the co-located picture andthe co-located picture. The reference picture index of temporal mergecandidate is set equal to zero. A practical realization of the scalingprocess is described in the HEVC specification. For a B-slice, twomotion vectors, one is for reference picture list 0 and the other is forreference picture list 1, are obtained and combined to make thebi-predictive merge candidate.

FIG. 8 shows an example of a motion vector scaling for temporal mergecandidates.

In the co-located PU (Y) belonging to the reference frame, the positionfor the temporal candidate is selected between candidates Co and Ci, asdepicted in FIG. 9 . If PU at position Co is not available, is intracoded, or is outside of the current CTU, position Ci is used. Otherwise,position Co is used in the derivation of the temporal merge candidate.

2.2.1.4 Additional Candidates Insertion

Besides spatio-temporal merge candidates, there are two additional typesof merge candidates: combined bi-predictive merge candidate and zeromerge candidate. Combined bi-predictive merge candidates are generatedby utilizing spatio-temporal merge candidates. Combined bi-predictivemerge candidate is used for B-Slice only. The combined bi-predictivecandidates are generated by combining the first reference picture listmotion parameters of an initial candidate with the second referencepicture list motion parameters of another. If these two tuples providedifferent motion hypotheses, they will form a new bi-predictivecandidate. As an example, FIG. 10 depicts the case when two candidatesin the original list (on the left), which have mvL0 and refIdxL0 or mvL1and refIdxL1, are used to create a combined bi-predictive mergecandidate added to the final list (on the right). Existingimplementations provide numerous rules regarding the combinations whichare considered to generate these additional merge candidates.

Zero motion candidates are inserted to fill the remaining entries in themerge candidates list and therefore hit the MaxNumMergeCand capacity.These candidates have zero spatial displacement and a reference pictureindex which starts from zero and increases every time a new zero motioncandidate is added to the list. The number of reference frames used bythese candidates is one and two for uni and bi-directional prediction,respectively. Finally, no redundancy check is performed on thesecandidates.

2.2.1.5 Motion Estimation Regions for Parallel Processing

To speed up the encoding process, motion estimation can be performed inparallel whereby the motion vectors for all prediction units inside agiven region are derived simultaneously. The derivation of mergecandidates from spatial neighbourhood may interfere with parallelprocessing as one prediction unit cannot derive the motion parametersfrom an adjacent PU until its associated motion estimation is completed.To mitigate the trade-off between coding efficiency and processinglatency, HEVC defines the motion estimation region (MER) whose size issignalled in the picture parameter set using the“log2_parallel_merge_level_minus2” syntax element. When a MER isdefined, merge candidates falling in the same region are marked asunavailable and therefore not considered in the list construction.

7.3.2.3 Picture Parameter Set RBSP Syntax

7.3.2.3.1 General Picture Parameter Set RBSP Syntax

Descriptor pic_parameter_set_rbsp( ) {  pps _(—) pic _(—) parameter _(—)set _(—) id ue(v)  pps _(—) seq _(—) parameter _(—) set _(—) id ue(v) dependent _(—) slice _(—) segments _(—) enabled _(—) flag u(1) ...  pps_(—) scaling _(—) list _(—) data _(—) present _(—) flag u(1)  if(pps_scaling_list_data_present_flag )  scaling_list_data( )  lists _(—)modification _(—) present _(—) flag u(1)  log2 _(—) parallel _(—) merge_(—) level _(—) minus2 ue(v)  slice _(—) segment _(—) header _(—)extension _(—) present _(—) flag u(1)  pps _(—) extension _(—) present_(—) flag u(1) ...  rbsp_trailing_bits( ) }

log2_parallel_merge_level_minus2 plus 2 specifies the value of thevariable Log2ParMrgLevel, which is used in the derivation process forluma motion vectors for merge mode as specified in clause 8.5.3.2.2 andthe derivation process for spatial merging candidates as specified inclause 8.5.3.2.3. The value of log2_parallel_merge_level_minus2 shall bein the range of 0 to CtbLog2SizeY−2, inclusive.

The variable Log2ParMrgLevel is derived as follows:Log2ParMrgLevel=log2_parallel_merge_level_minus2+2  (7-37)

NOTE 3—The value of Log2ParMrgLevel indicates the built-in capability ofparallel derivation of the merging candidate lists. For example, whenLog2ParMrgLevel is equal to 6, the merging candidate lists for all theprediction units (PUs) and coding units (CUs) contained in a 64×64 blockcan be derived in parallel.

2.2.2 Motion Vector Prediction in AMVP Mode

Motion vector prediction exploits spatio-temporal correlation of motionvector with neighbouring PUs, which is used for explicit transmission ofmotion parameters. It constructs a motion vector candidate list byfirstly checking availability of left, above temporally neighbouring PUpositions, removing redundant candidates and adding zero vector to makethe candidate list to be constant length. Then, the encoder can selectthe best predictor from the candidate list and transmit thecorresponding index indicating the chosen candidate. Similarly withmerge index signalling, the index of the best motion vector candidate isencoded using truncated unary. The maximum value to be encoded in thiscase is 2 (see FIG. 6 ). In the following sections, details aboutderivation process of motion vector prediction candidate are provided.

2.2.2.1 Derivation of Motion Vector Prediction Candidates

FIG. 11 summarizes derivation process for motion vector predictioncandidate.

In motion vector prediction, two types of motion vector candidates areconsidered: spatial motion vector candidate and temporal motion vectorcandidate. For spatial motion vector candidate derivation, two motionvector candidates are eventually derived based on motion vectors of eachPU located in five different positions as depicted in FIG. 5 .

For temporal motion vector candidate derivation, one motion vectorcandidate is selected from two candidates, which are derived based ontwo different co-located positions. After the first list ofspatio-temporal candidates is made, duplicated motion vector candidatesin the list are removed. If the number of potential candidates is largerthan two, motion vector candidates whose reference picture index withinthe associated reference picture list is larger than 1 are removed fromthe list. If the number of spatio-temporal motion vector candidates issmaller than two, additional zero motion vector candidates is added tothe list.

2.2.2.2 Spatial Motion Vector Candidates

In the derivation of spatial motion vector candidates, a maximum of twocandidates are considered among five potential candidates, which arederived from PUs located in positions as depicted in FIG. 5 , thosepositions being the same as those of motion merge. The order ofderivation for the left side of the current PU is defined as A0, A1, andscaled A0, scaled A1. The order of derivation for the above side of thecurrent PU is defined as B0, B1, B2, scaled B0, scaled B1, scaled B2.For each side there are therefore four cases that can be used as motionvector candidate, with two cases not required to use spatial scaling,and two cases where spatial scaling is used. The four different casesare summarized as follows.

No Spatial Scaling

-   -   (1) Same reference picture list, and same reference picture        index (same POC)    -   (2) Different reference picture list, but same reference picture        (same POC)

Spatial Scaling

-   -   (3) Same reference picture list, but different reference picture        (different POC)    -   (4) Different reference picture list, and different reference        picture (different POC)

The no-spatial-scaling cases are checked first followed by the spatialscaling. Spatial scaling is considered when the POC is different betweenthe reference picture of the neighbouring PU and that of the current PUregardless of reference picture list. If all PUs of left candidates arenot available or are intra coded, scaling for the above motion vector isallowed to help parallel derivation of left and above MV candidates.Otherwise, spatial scaling is not allowed for the above motion vector.

FIG. 14 shows an example of motion vector scaling for a spatial motionvector candidate.

In a spatial scaling process, the motion vector of the neighbouring PUis scaled in a similar manner as for temporal scaling, as depicted asFIG. 12 . The main difference is that the reference picture list andindex of current PU is given as input; the actual scaling process is thesame as that of temporal scaling.

2.2.2.3 Temporal Motion Vector Candidates

Apart for the reference picture index derivation, all processes for thederivation of temporal merge candidates are the same as for thederivation of spatial motion vector candidates (see FIG. 4 ). Thereference picture index is signalled to the decoder.

2.2.2.4 Signalling of Merge/AMVP Information

For the AMVP mode, four parts may be signalled in the bitstream, i.e.,prediction direction, reference index, MVD and my predictor candidateindex (highlighted in the syntax table below). While for the merge mode,only a merge index may need to be signalled.

Syntax Tables:

7.3.6.1 General Slice Segment Header Syntax

Descriptor slice_segment_header( ) { ... if( slice_type == P ∥slice_type == B ) { if( ( weighted_pred_flag && slice_type == P ) ∥  (weighted_bipred_flag && slice_type == B ) ) pred_weight_table( ) five_(—) minus _(—) max _(—) num _(—) merge _(—) cand ue(v) if(motion_vector_resolution_control_idc == 2 ) use _(—) integer _(—) mv_(—) flag u(1) } ...7.3.8.6 Prediction Unit Syntax

Descriptor prediction_unit( x0, y0, nPbW, nPbH ) { if( cu_skip_flag[ x0][ y0 ] ) { if( MaxNumMergeCand > 1 ) merge _(—) idx[ x0 ][ y0 ] ae(v) }else { /* MODE_INTER */ merge _(—) flag[ x0 ][ y0 ] ae(v) if(merge_flag[ x0 ][ y0 ] ) { if( MaxNumMergeCand > 1 ) merge _(—) idx[ x0][ y0 ] ae(v) } else { if( slice_type == B ) inter _(—) pred _(—) idc[x0 ][ y0 ] ae(v) if( inter_pred_idc[ x0 ][ y0 ] != PRED_L1 ) { if(num_ref_idx_l0_active_minus1 > 0 ) ref _(—) idx _(—) l0[ x0 ][ y0 ]ae(v) mvd_coding( x0, y0, 0 ) mvp _(—) l0 _(—) flag[ x0 ][ y0 ] ae(v) }if( inter_pred_idc[ x0 ][ y0 ] != PRED_L0 ) { if(num_ref_idx_l1_active_minus1 > 0 ) ref _(—) idx _(—) l1[ x0 ][ y0 ]ae(v) if( mvd_l1_zero_flag && inter_pred_idc[ x0 ][ y0 ] == PRED_BI ) {MvdL1[ x0 ][ y0 ][ 0 ] = 0 MvdL1[ x0 ][ y0 ][ 1 ] = 0 } else mvd_coding(x0, y0, 1 ) mvp _(—) l1 _(—) flag[ x0 ][ y0 ] ae(v) } } } }7.3.8.9 Motion Vector Difference Syntax

Descriptor mvd_coding( x0, y0, refList ) { abs _(—) mvd _(—) greater0_(—) flag[ 0 ] ae(v) abs _(—) mvd _(—) greater0 _(—) flag[ 1 ] ae(v) if(abs_mvd_greater0_flag[ 0 ] ) abs _(—) mvd _(—) greater1 _(—) flag[ 0 ]ae(v) if( abs_mvd_greater0_flag[ 1 ] ) abs _(—) mvd _(—) greater1 _(—)flag[ 1 ] ae(v) if( abs_mvd_greater0_flag[ 0 ] ) { if(abs_mvd_greater1_flag[ 0 ] ) abs _(—) mvd _(—) minus2[ 0 ] ae(v) mvd_(—) sign _(—) flag[ 0 ] ae(v) } if( abs_mvd_greater0_flag[ 1 ] ) { if(abs_mvd_greater1_flag[ 1 ] ) abs _(—) mvd _(—) minus2[ 1 ] ae(v) mvd_(—) sign _(—) flag[ 1 ] ae(v) } }

Semantics

five_minus_max_num_merge_cand specifies the maximum number of mergingMVP candidates supported in the slice subtracted from 5. The maximumnumber of merging MVP candidates, MaxNumMergeCand is derived as follows:MaxNumMergeCand=5−five_minus_max_num_merge_cand

The value of MaxNumMergeCand shall be in the range of 1 to 5, inclusive.

merge_flag[x0][y0] specifies whether the inter prediction parameters forthe current prediction unit are inferred from a neighbouringinter-predicted partition. The array indices x0, y0 specify the location(x0, y0) of the top-left luma sample of the considered prediction blockrelative to the top-left luma sample of the picture.

When merge_flag[x0][y0] is not present, it is inferred as follows:

If CuPredMode[x0][y0] is equal to MODE_SKIP, merge_flag[x0][y0] isinferred to be equal to 1.

Otherwise, merge_flag[x0][y0] is inferred to be equal to 0.

merge_idx[x0][y0] specifies the merging candidate index of the mergingcandidate list where x0, y0 specify the location (x0, y0) of thetop-left luma sample of the considered prediction block relative to thetop-left luma sample of the picture.

2.3 Coding Structure in AVS2

Similar to HEVC, AVS2 also adopts the concept of CU, PU and TU-basedcoding/prediction/transform structure. First, pictures are split intolargest coding units (LCUs), which consist of 2N×2N samples. One LCU canbe a single CU or can be split into four smaller CUs with a quad-treepartition structure; a CU can be recursively split until it reaches thesmallest CU size limit, as shown in FIG. 13A. once the splitting of theCu hierarchical tree is finished, the leaf node CUs can be further splitinto PUs. PU is the basic unit for intra- and inter prediction andallows multiple different shapes to encoder irregular image patterns, asshown in FIG. 13B. In FIG. 13A, the maximum possible recursive CUstructure in AVS2 is shown, e.g. LCU size=64, maximum hierarchicaldepth=4; FIG. 13B shows possible PU splitting for skip, intra modes, andinter modes in AVS2, including symmetric and asymmetric prediction (d=1,2 for intra prediction; and d=0, 1, 2 for inter prediction).

2.4 Inter Prediction in AVS2/AVS3

Similar to HEVC, there are two inter-coded frame types, P frame and Bframe. A P frame is a forward-predicted frame using a single referencepicture, while a B frame is a bipredicted frame that consists offorward, backward, bi-prediction, and symmetric prediction, using tworeference frames. In a B frame, in addition to the conventional forward,backward, bi-directional, and skip/direct prediction modes, symmetricprediction is defined as a special bi-prediction mode, wherein only oneforward motion vector (MV) is coded and the backward MV is derived fromthe forward MV based on the picture-order-counter (POC) distances. Thesymmetry mode could efficiently represent the linear motion model of anobject.

2.4.1 Syntax and Semantics for a Coding Unit

coding_unit ( SizeInBit, PositionInPic ) { if ( PictureType != 0) cu_(—) type _(—) index ae(v) if ( ( CuTypeIndex == 3 ∥ CuTypeIndex == 4 )&& ( AsymmetricMotionPartitionsEnable == 1 ) && SizeInBit > 3 ) shape_(—) of _(—) partition _(—) index ae(v) if ( PictureType == 2 &&CuTypeIndex >= 2 && CuTypeIndex <= 4) )  if ( CuTypeIndex == 2 ∥SizeInBit > 3 ) b _(—) pu _(—) type _(—) index ae(v) else b _(—) pu _(—)type _(—) min _(—) index ae(v) if ( CuType == ‘B_Skip’ ∥ CuType ==‘B_Direct_2N’ ) cu _(—) subtype _(—) index ae(v) if ( CuType != ‘P_Skip’&& CuType != ‘B_Skip’ && CuType != ‘F_Skip’ && CuType != ‘S_Skip’ ) { if( CuType == ‘B_NxN’ ) { for (i=0; i<4; i++) b _(—) pu _(—) type _(—)index2[i] ae(v) } if ( IntraCuFlag == 1 ) { if ( (SizeInBit == 3) ∥((NsipEnableFlag==1) && (3<SizeInBit<6) ) ) transform _(—) split _(—)flag ae(v) if (NsipEnableFlag==1 && (SizeInBit==4 ∥ SizeInBit==5) &&TransformSplitFlag==1) intra _(—) pu _(—) type _(—) index for ( i=0;i<NumOfIntraPredBlock; i++ ) intra _(—) luma _(—) pred _(—) mode ae(v)if ( chroma_format != ‘00’ ) intra _(—) chroma _(—) pred _(—) mode ae(v)} if ( (PictureType == 1 || PictureType == 3) && RefPicNum > 1 ) { for (i = 0; i < CuMvNum; i++ ) pu _(—) reference _(—) index ae(v) } for ( i =0; i < maxPredUnitOrder; i++ ) { if ( FwdMVExist ) { mv _(—) diff _(—) x_(—) abs ae(v) if ( MvDiffXAbs ) mv _(—) diff _(—) x _(—) sign ae(v) mv_(—) diff _(—) y _(—) abs ae(v) if ( MvDiffYAbs ) mv _(—) diff _(—) y_(—) sign ae(v) } } for ( i = maxPredUnitOrder; i < 2×maxPredUnitOrder;i++ ) { if ( BckMVExist ) { mv _(—) diff _(—) x _(—) abs ae(v) if (MvDiffXAbs ) mv _(—) diff _(—) x _(—) sign ae(v) mv _(—) diff _(—) y_(—) abs ae(v) if ( MvDiffYAbs ) mv _(—) diff _(—) y _(—) sign ae(v) } }Taking B frame as an example, based on CuTypeIndex andShapeOfPartitionIndex, and table 81 below to derive CU type (CuType),prediction partition types and PU prediction mode (PuPredMode).

TABLE 81 CU types and related information for B frames CuTypeIndexShapeOfPartitionIndex CuType PUPartTye PuPredMode 0 — B_Skip From Table82 From Table 82 1 — B_Direct_2N From Table 82 From Table 82 2 — B_2NNO_SPLIT From Table 83 3 0 B_2N_H HOR_SYM From Table 84 3 1 B_2N_HUHOR_UP 3 2 B_2N_HD HOR_DOWN 4 0 B_2N_V VER_SYM 4 1 B_2N_VL VER_LEFT 4 2B_2N_VR VER_RIGHT 5 — B_NxN CROSS_SPLIT From Table 85 6 — From Table 79—

TABLE 82 subCU type and related information for B frames Number CuTypeCuSubtypeIdx SizeInBit SubCUType PUPartTye PuPredMode of MVs B_Skip 0 >3B_Skip_Sym CROSS_SPLIT Symmtric 0 0  3 B_Skip_Sym NO_SPLIT Symmtric 0 1— B_Skip_Spatial_Bi NO_SPLIT Bi-direction 0 2 — B_Skip_Spatial_BckNO_SPLIT Backward 0 3 — B_Skip_Spatial_Sym NO_SPLIT Symmtric 0 4 —B_Skip_Spatial_Fwd NO_SPLIT Forward 0 B_Direct_2N 0 >3 B_Direct_2N_SymCROSS_SPLIT Symmtric 0 0  3 B_Direct_2N_Sym NO_SPLIT Symmtric 0 1 —B_Direct_2N_Spatial_Bi NO_SPLIT Bi-direction 0 2 —B_Direct_2N_Spatial_Bck NO_SPLIT Backward 0 3 — B_Direct_2N_Spatial_SymNO_SPLIT Symmtric 0 4 — B_Direct_2N_Spatial_Fwd NO_SPLIT Forward 0

2.4.2 Multi-Motion Model Based Skip/Direct Modes

The SKIP mode's motion information of the current block is derived frompreviously decoded blocks and no residual information is encoded.Similar to SKIP mode, DIRECT mode has no motion information to transmitwhile prediction residuals and mode information are transmitted.

As an expansion of traditional SKIP and DIRECT modes wherein motioninformation from only one temporal prediction block (CuSubtypeIdx equalto 0) is utilized, four additional motion models based SKIP and DIRECTmodes are introduced in AVS2 and AVS3, i.e. bi-direction DIRECT/SKIPmode (CuSubtypeIdx equal to 1), symmetry DIRECT/SKIP mode (CuSubtypeIdxequal to 2), backward DIRECT/SKIP mode (CuSubtypeIdx equal to 3) andforward DIRECT/SKIP mode (CuSubtypeIdx equal to 4).

A priority-based motion information derivation method is designed whichtakes block's motion model (prediction direction) into consideration. Ahigher priority is assigned to the motion information of neighbor blockswith the same motion model as current block.

For each of the four additional motion model based skip/direct mode, themotion information derivation process can be divided into three stepsperformed in order.

Motion model-matched search: As shown in FIG. 14 , an initial process offinding neighbor blocks with the same motion model as current block atpositions F, G, C, A, B, D is conducted in that order. Once the firstblock sharing the same motion model with current block is found, themotion information of that block is assigned to current block.

Artificial search: In case of there isn't a neighbor block sharing thesame motion model with current block (i.e., no result found from step1)), a second process of artificial constructing motion information ofcurrent block is conducted. This process varies from one motion model toanother.

For bi-direction DIRECT/SKIP mode, count how many spatial neighbors arecoded with forward-direction, denoted by Nfw and how many spatialneighbors are coded with backward-direction, denoted by Nbw. If Nfw andNbw are both equal to or larger than 1, the combination of the firstforward and the first backward prediction blocks' motion information isassigned to current block. The searching order is the same as the 1ststep, i.e., from positions F, G, C, A, B, and D.

For symmetry DIRECT/SKIP mode, the following steps are performed inorder:

count how many spatial neighbors are coded with bi-direction, denoted byNbi

If Nbi is equal to or larger than 2, the motion information of neighborbi-direction predicted blocks' motion information of the last block inscanning order of F, G, C, A, B and D (which is equal to the first blockin the scanning order of D, B, A, C, G and F) is assigned to currentblock.

else (if Nbi is smaller than 2) if Nbw is equal to or larger than 1wherein Nbw denotes how many spatial neighbors are coded withbackward-direction, the backward motion vector (denoted by MvE1) of thefirst backward prediction blocks' motion information is assigned tocurrent block and the forward motion vector MvE0 is set equal toClip3(−32768, 32767, −MvE1). The searching order is the same as the 1ststep, i.e., from positions F, G, C, A, B, and D.

else (if Nbi is smaller than 2 and Nbw is smaller than 1) if Nfw isequal to or larger than 1 wherein Nfw denotes how many spatial neighborsare coded with forward-direction, the forward motion vector (denoted byMvE0) of the first forward prediction blocks' motion information isassigned to current block and the backward motion vector MvE1 is setequal to Clip3(−32768, 32767, −MvE0). The searching order is the same asthe 1st step, i.e., from positions F, G, C, A, B, and D.

For backward DIRECT/SKIP mode, count how many spatial neighbors arecoded with bi-direction, denoted by Nbi. the backward motion informationof the last neighbor bi-direction predicted block is assigned to currentblock. The searching order is the same as the 1st step, i.e., frompositions F, G, C, A, B, and D.

For forward DIRECT/SKIP mode, count how many spatial neighbors are codedwith bi-direction, denoted by Nbi. the forward motion information of thelast neighbor bi-direction predicted block is assigned to current block.The searching order is the same as the 1st step, i.e., from positions F,G, C, A, B, and D.

Default MVs construction: this step is invoked only when both step 1)and step 2) fail to find available motion vectors. In AVS2/AVS3, thefollowing applies:

For bi-direction/symmetry skip/direct modes, zero motion vectors are setfor both forward and backward directions.

For backward DIRECT/SKIP mode, the backward motion vector is set to be azero MV, i.e., (0, 0)

For forward DIRECT/SKIP mode, the forward motion vector is set to be azero MV, i.e., (0, 0).

Since there are multiple SKIP and DIRECT modes, it would be required tobring some side information in signaling SKIP and DIRECT modes' motionmodel. In AVS2 reference software RD3.0, the Rate-distortionoptimization method is used to select a mode to encode a block. The sideinformation is taken into consideration to yield a more accurate costvalue when calculate the RD-cost of the new SKIP and DIRECT modes.

3. Examples of Problems Solved by Embodiments

The AVS2/AVS3 multi-motion model based skip/direct mode takes thecorrelation of motion model between current block and its adjacentneighbouring blocks. However, it couldn't take the advantage ofsimilarity between current block and non-adjacent blocks. Use ofpreviously coded motion information in history for better motion vectorprediction can be used. Similar ideas could be also be applied to themulti-direction skip/direct modes with some details to be developed tofit the design in AVS2/AVS3.

In addition, for each motion model, only one candidate is allowed whichmay restrict the coding gain of motion prediction.

4. Examples Embodiments of the Disclosed Technology

To address the problem, several methods including using one or more lookup tables (LUTs, to store the motion information in the history) topredict motion information of a block. The entry to a LUT is a motioncandidate. An HMVP (history-based motion vector predictor) candidate isused to indicate a set of motion information stored in a look-up table(LUT).

The detailed embodiment examples below should be considered as examplesto explain general concepts. These embodiments should not be interpretedin a narrow way. Furthermore, these embodiments can be combined in anymanner.

-   -   1. For a given motion model, HMVP candidates or motion        candidates from non-adjacent spatial blocks or temporal blocks        belonging to the same motion model may be used to be a candidate        for the multi-motion model based methods (e.g., SKIP/DIRECT        modes design in AVS2).        -   a. In one example, before performing the artificial            searching process, HMVP candidates or motion candidate from            non-adjacent spatial blocks or temporal blocks may be            checked in order. If there is one HMVP candidate or one            motion candidate from non-adjacent spatial blocks or            temporal blocks belonging to the same motion model, it is            marked as the final motion candidate and the searching            process terminates.        -   b. In one example, before performing the default MVs            construction process, HMVP candidates or motion candidate            from non-adjacent spatial blocks or temporal blocks may be            checked in order. If there is one HMVP candidate or one            motion candidate from non-adjacent spatial blocks or            temporal blocks belonging to the same motion model, it is            marked as the final motion candidate and the searching            process terminates.        -   c. In one example, HMVP candidates or motion candidates from            non-adjacent spatial blocks or temporal blocks may be            considered in the artificial searching process. For example,            HMVP candidates may be searched after positions F, G, C, A,            B, and D. In this case, one HMVP candidate or motion            candidate from a non-adjacent spatial block or temporal            block may be treated as one candidate from a relative            position like those from adjacent spatial blocks.    -   2. Motion models defined in multi-motion model based methods        (e.g., SKIP/DIRECT modes design in AVS2) may be further extended        to cover the usage of HMVP. That is, HMVP candidates may be        treated as new motion models and added to the candidate list in        multi-motion model based method.        -   a. In one example, for each entry of the LUTs storing HMVP            candidates is treated as a new motion model.        -   b. Alternatively, all HMVP candidates are treated to be one            new motion model. An indication of motion model may be            firstly signaled, followed by the index of the HMVP            candidates if the indication tells it is belonging to HMVP            category.    -   3. Motion models defined in in multi-motion model based methods        (e.g., SKIP/DIRECT modes in AVS2) may be further extended to        cover the usage of motion information from non-adjacent blocks.        That is, motion information from non-adjacent blocks may be        treated as new motion models and added to candidate list in the        in multi-motion model based method.        -   a. In one example, for each motion candidate of non-adjacent            blocks is treated as a new motion model.        -   b. Alternatively, all motion candidates from non-adjacent            blocks are treated to be one new motion model, named            non-adjacent motion category. An indication of motion model            may be firstly signaled, followed by the index of motion            candidates from non-adjacent blocks if the indication tells            it is belonging to non-adjacent motion category.    -   4. New motion models may be inserted before/after existing        motion models in AVS2/AVS3.        -   a. In one example, all HMVP candidates are inserted after            all the existing motion models.        -   b. Alternatively, some HMVP candidates are inserted before            some existing motion models in AVS2/AVS3, while other HMVP            candidates are inserted after all existing motion models in            AVS2/AVS3.        -   c. The whole list of candidates (temporal, bi-direction,            symmetry, backward and forward, motion model for HMVP and/or            non-adjacent blocks) may be reordered after each model finds            its related candidates.            -   i. In one example, the zero motion candidates in all or                multiple motion models like bi-direction, symmetry,                backward and forward may be replaced by motion candidate                from other motion models.    -   5. Similarly to the design of HMVP in PCT/CN2018/093663 and,        PCT/CN2018/093987, the coded motion information from previously        coded blocks may be used as a predictor for coding current        block. However, the coded motion information is classified and        inserted to multiple look up tables based on the motion model.        -   a. In one example, the categories of motion models used in            HMVP process are the same as those used in multi-motion            model based methods (e.g., SKIP/DIRECT modes in AVS2), i.e.,            bi-direction, symmetric direction, backward, forward.        -   b. Alternatively, only partial of motion models defined in            SKIP/DIRECT modes are used in HMVP process to reduce the            required memory for storing HMPV candidates for all kinds of            motion models.    -   6. Instead of allowing one candidate for each motion model as in        multi-motion model based methods (e.g., the SKIP/DIRECT mode of        AVS2), multiple candidates for one motion model are allowed.        That is, a candidate list for each motion model may be        constructed.        -   a. In one example, an index of the multiple candidates may            be further signaled. In this case, two syntax elements are            involved (the first to indicate the motion model and the            second to indicate a candidate index of the candidate list            corresponding the selected motion model).        -   b. Alternatively, one of the multiple candidates may be            selected at the decoder side without being signaled.        -   c. Alternatively, only one candidate list is constructed            however, multiple candidates with the same motion model may            be added. In this case, only one index may be signaled.        -   d. In one example, multiple candidates may be derived from            adjacent spatial neighboring blocks with the same motion            model.        -   e. In one example, multiple candidates may be derived from            non-adjacent spatial neighboring blocks with the same motion            model.        -   f. In one example, multiple candidates may be derived from            HMVP candidates with the same motion model.        -   g. In one example, multiple candidates may be derived from            either one of the three steps (Motion model-matched search,            artificial search, default MVs) used in the SKIP/DIRECT            mode.        -   h. The size of allowed multiple candidates for all motion            models may be the same.        -   i. Alternatively, the size of allowed multiple candidates            for different motion models may be different.        -   j. The size(s) of allowed multiple candidates may be            pre-defined or signaled in sequence parameter set/picture            parameter set/slice header, etc. al.        -   k. The size(s) of allowed multiple candidates may further            depend on block sizes/block shapes/coded mode (skip or            direct)/picture or slice types/low delay check flags.    -   7. The searching order and/or searching points (spatial/temporal        neighboring blocks) in the multi-motion model based solutions        may depend on the motion model.        -   a. In one example, different searching orders may be            utilized for different motion models. The orders may be            pre-defined.        -   b. In one example, the searching order may be adaptively            changed from block to block.        -   c. In one example, the searching order may be adaptively            changed based on the searching results of another motion            model.        -   d. In one example, the searching order and/or searching            points (spatial/temporal neighboring blocks) in the            multi-motion model based solutions may depend on block            shape/block size/coded mode, etc. al.    -   8. Pruning may be applied between a HMVP candidate with a        candidate from non-adjacent spatial block or temporal block.        -   a. If two candidates are identical or motion vector            differences are smaller than threshold(s), only one of the            two could be added to the candidate list.    -   9. Pruning may be applied between a HMVP candidate with a        candidate derived from existing multi-model motion based        SKIP/DIRECT mode design.        -   a. Similarly, pruning may be applied between a candidate            from non-adjacent spatial block or temporal block with a            candidate derived from existing SKIP/DIRECT mode design.        -   b. In one example, the candidate derived from existing            SKIP/DIRECT mode design indicates a candidate found in the            ‘Motion model-matched search’ process in section 2.4.2.        -   c. In one example, the candidate derived from existing            SKIP/DIRECT mode design indicates the candidate found after            the ‘default MVs construction’ process in section 2.4.2.        -   d. In one example, pruning process is skipped if the            candidate derived from existing multi-model motion based            SKIP/DIRECT mode design is from the ‘Artificial search            process’ or ‘default MVs construction process’.    -   10. In one example, pruning operation is conducted only between        MV candidates of the same motion model.    -   11. In one example, there is an individual historical MV list        for each motion model. When a motion model is searched, the MV        candidate in the historical MV list for that model can be added        to the merge candidate list.        -   a. In one embodiment, historical MV list is built for only            some motion models, such as the bi-prediction model and the            symmetric prediction model, but not built for some other            models, such as the forward-prediction model and the            backward-prediction model.        -   b. In one embodiment, the historical MV list for a motion            model is updated only after coding/decoding an inter-coded            block with the MV of that motion model.    -   12. The coding of cu_subtype_index may be extended to allow it        to include multiple candidates in addition to the five existing        motion models.        -   a. In one example, truncated binarization method may be            utilized.        -   b. In one example, each bin may be coded with contexts.        -   c. In one example, partial bins may be coded with contexts            and the remaining bins may be coded with bypass mode.    -   13. The total number of allowed motion models may be        pre-defined.        -   a. Alternatively, the total number of allowed motion models            may be signaled in sequence header, picture header, slice            header.        -   b. In one example, each HMVP candidate may be treated as one            motion model in terms of the signaling of allowed motion            models.    -   14. It is proposed that when a block is coded with a HMVP        candidate (i.e., from the look-up-table which stores motion        information from previously coded blocks), such a candidate is        not used to update the LUT.

FIG. 15 is a block diagram of a video processing apparatus 1500. Theapparatus 1500 may be used to implement one or more of the methodsdescribed herein. The apparatus 1500 may be embodied in a smartphone,tablet, computer, Internet of Things (IoT) receiver, and so on. Theapparatus 1500 may include one or more processors 1502, one or morememories 1504 and video processing hardware 1506. The processor(s) 1502may be configured to implement one or more methods described in thepresent document. The memory (memories) 1504 may be used for storingdata and code used for implementing the methods and techniques describedherein. The video processing hardware 1506 may be used to implement, inhardware circuitry, some techniques described in the present document.

FIG. 16 is a block diagram of an example implementation of a videoencoder. FIG. 16 shows that the encoder implementation has a feedbackpath built in in which the video encoder also performs video decodingfunctionality (reconstructing compressed representation of video datafor use in encoding of next video data).

FIG. 17 is a block diagram showing an example video processing system1700 in which various techniques disclosed herein may be implemented.Various implementations may include some or all of the components of thesystem 1700. The system 1700 may include input 1702 for receiving videocontent. The video content may be received in a raw or uncompressedformat, e.g., 8 or 10 bit multi-component pixel values, or may be in acompressed or encoded format. The input 1702 may represent a networkinterface, a peripheral bus interface, or a storage interface. Examplesof network interface include wired interfaces such as Ethernet, passiveoptical network (PON), etc. and wireless interfaces such as Wi-Fi orcellular interfaces.

The system 1700 may include a coding component 1704 that may implementthe various coding or encoding methods described in the presentdocument. The coding component 1704 may reduce the average bitrate ofvideo from the input 1702 to the output of the coding component 1704 toproduce a coded representation of the video. The coding techniques aretherefore sometimes called video compression or video transcodingtechniques. The output of the coding component 1704 may be eitherstored, or transmitted via a communication connected, as represented bythe component 1706. The stored or communicated bitstream (or coded)representation of the video received at the input 1702 may be used bythe component 1708 for generating pixel values or displayable video thatis sent to a display interface 1710. The process of generatinguser-viewable video from the bitstream representation is sometimescalled video decompression. Furthermore, while certain video processingoperations are referred to as “coding” operations or tools, it will beappreciated that the coding tools or operations are used at an encoderand corresponding decoding tools or operations that reverse the resultsof the coding will be performed by a decoder.

Examples of a peripheral bus interface or a display interface mayinclude universal serial bus (USB) or high definition multimediainterface (HDMI) or Displayport, and so on. Examples of storageinterfaces include SATA (serial advanced technology attachment), PCI,IDE interface, and the like. The techniques described in the presentdocument may be embodied in various electronic devices such as mobilephones, laptops, smartphones or other devices that are capable ofperforming digital data processing and/or video display.

FIG. 18A is a flowchart for an example method 1800 for video processing.The method 1800 includes, at step 1802, applying, to a candidate listfor a video block, a pruning operation between a candidate in a firstset of candidates derived from previously coded blocks in a decodingorder and a candidate in a second set of candidates.

The method 1800 includes, at step 1804, performing, based on thecandidate list subsequent to applying the pruning operation, aconversion between the video block and a bitstream representation of thevideo block.

FIG. 18B is a flowchart for an example method 1830 for video processing.The method 1830 includes, at step 1832, applying, to a candidate listfor a video block, a pruning operation between a first set of candidatescomprising candidates from spatially or temporally non-adjacent blocksand a second set of candidates comprising candidates derived from amulti-motion model based skip mode or direct mode design.

The method 1830 includes, at step 1834, performing, based on thecandidate list subsequent to applying the pruning operation, aconversion between the video block and a bitstream representation of thevideo block.

FIG. 18C is a flowchart for an example method 1860 for video processing.The method 1860 includes, at step 1862, refraining from applying apruning operation to a candidate list for a video block, the candidatelist comprising a plurality of candidates derived from a multi-motionmodel based skip mode or direct mode design, and each of the pluralityof candidates being based on a motion model-matched search or a defaultmotion vector construction process.

The method 1860 includes, at step 1864, performing, based on thecandidate list, a conversion between the video block and a bitstreamrepresentation of the video block.

In the methods described herein, in some embodiments, the conversion mayinclude encoding the video block and video to generate a codedrepresentation or a bitstream. In some embodiments, the conversion mayinclude decoding a coded representation or bitstream to generate pixelvalues of the video block. In some embodiments, the conversion may be atranscoding operation in which bitrate or format of video representationis changed.

Improvements achieved by incorporating embodiments of the disclosedtechnology into HEVC reference software are shown in the experimentalresults below.

The tables below show the Bjøntegaard delta bitrate (or BD-rate) gainand processing time impact of the proposed approach. Different sets ofsimulations (with different encoder complexity) are conducted for the RAand LDP configurations, following the common test conditions on top ofreference software TAVS3-1.0. For example, “RA” represents random accesscorresponding to a set of coding conditions designed to enablerelatively-frequent random access points in the coded video data, withless emphasis on minimization of delay. In contrast, “LDP” representslow-delay conditions using P frames designed to enable interactivereal-time communication, with less emphasis on ease of random access. Inall the tests, the table size S is set to 8 and constraint FIFO rule (toremove and add entries to the candidate table) is applied.

TABLE 1 Performance of HMVP under RA with N_(rdo) = 3 Seq BDR-Y BDR-UBDR-V Enc Dec 720p −1.67% −0.44% −0.77% 97.80% 103.32% 1080p −1.16%−0.89% −1.01% 97.84% 104.17% 4K −2.81% −1.13% −0.66% 96.32% 100.87% All−1.88% −0.82% −0.81% 97.32% 102.78%

TABLE 2 Performance of HMVP under RA with N_(rdo) = 4 Seq BDR-Y BDR-UBDR-V Enc Dec 720p −1.86% −0.41% −0.85% 104.06% 100.67% 1080p −1.44%−1.28% −1.22% 102.40% 103.63% 4K −3.13% −1.45% −1.02% 101.44% 100.70%All −2.14% −1.04% −1.03% 102.63% 101.67%

TABLE 3 Performance of HMVP under RA with N_(rdo) = 5 Seq BDR-Y BDR-UBDR-V Enc Dec 720p −1.86% −0.62% −0.75% 109.19% 102.19% 1080p −1.78%−1.57% −1.34% 107.96% 104.60% 4K −2.27% −1.20% −0.86% 106.36% 101.60%All −1.97% −1.13% −0.99% 107.83% 102.80%

TABLE 4 Performance of HMVP under LDP with N_(rdo) = 2 Seq BDR-Y BDR-UBDR-V Enc Dec 720p −1.83% −0.64% −0.86% 97.01% 103.70% 1080p −2.21%−1.77% −1.72% 98.57% 103.77% 4K −2.14% −2.34% −2.08% 95.50% 103.63% All−2.06% −1.58% −1.55% 97.03% 103.70%

TABLE 5 Performance of HMVP under LDP with N_(rdo) = 3 Seq BDR-Y BDR-UBDR-V Enc Dec 720p −2.40% −0.74% −0.63% 101.87% 104.28% 1080p −2.85%−2.34% −2.33% 103.21% 105.12% 4K −2.17% −2.83% −2.52% 100.42% 105.40%All −2.48% −1.97% −1.83% 101.83% 104.93%

When there are up to 8 HMVP candidates, compared with TAVS3-1.0reference software model, the above simulation results show that someembodiments described in this document achieve 1.88%, 2.14%, 1.94% BDrate reduction for random access (RA) with 3, 4 or 5 fullrate-distortion optimization (RDO) processes respectively. For the LDPcase, the proposed HMVP achieves 2.06% and 2.48% BD rate reduction with2 or 3 full RDO processes, respectively. Minor encoding and decodingtime impact is noticed and for some cases, encoder running time could beeven reduced compared to TAVS2-1.0.

The disclosed and other solutions, examples, embodiments, modules andthe functional operations described in this document can be implementedin digital electronic circuitry, or in computer software, firmware, orhardware, including the structures disclosed in this document and theirstructural equivalents, or in combinations of one or more of them. Thedisclosed and other embodiments can be implemented as one or morecomputer program products, i.e., one or more modules of computer programinstructions encoded on a computer readable medium for execution by, orto control the operation of, data processing apparatus. The computerreadable medium can be a machine-readable storage device, amachine-readable storage substrate, a memory device, a composition ofmatter effecting a machine-readable propagated signal, or a combinationof one or more them. The term “data processing apparatus” encompassesall apparatus, devices, and machines for processing data, including byway of example a programmable processor, a computer, or multipleprocessors or computers. The apparatus can include, in addition tohardware, code that creates an execution environment for the computerprogram in question, e.g., code that constitutes processor firmware, aprotocol stack, a database management system, an operating system, or acombination of one or more of them. A propagated signal is anartificially generated signal, e.g., a machine-generated electrical,optical, or electromagnetic signal, that is generated to encodeinformation for transmission to suitable receiver apparatus.

A computer program (also known as a program, software, softwareapplication, script, or code) can be written in any form of programminglanguage, including compiled or interpreted languages, and it can bedeployed in any form, including as a stand-alone program or as a module,component, subroutine, or other unit suitable for use in a computingenvironment. A computer program does not necessarily correspond to afile in a file system. A program can be stored in a portion of a filethat holds other programs or data (e.g., one or more scripts stored in amarkup language document), in a single file dedicated to the program inquestion, or in multiple coordinated files (e.g., files that store oneor more modules, sub programs, or portions of code). A computer programcan be deployed to be executed on one computer or on multiple computersthat are located at one site or distributed across multiple sites andinterconnected by a communication network.

The processes and logic flows described in this document can beperformed by one or more programmable processors executing one or morecomputer programs to perform functions by operating on input data andgenerating output. The processes and logic flows can also be performedby, and apparatus can also be implemented as, special purpose logiccircuitry, e.g., an FPGA (field programmable gate array) or an ASIC(application specific integrated circuit).

Processors suitable for the execution of a computer program include, byway of example, both general and special purpose microprocessors, andany one or more processors of any kind of digital computer. Generally, aprocessor will receive instructions and data from a read only memory ora random-access memory or both. The essential elements of a computer area processor for performing instructions and one or more memory devicesfor storing instructions and data. Generally, a computer will alsoinclude, or be operatively coupled to receive data from or transfer datato, or both, one or more mass storage devices for storing data, e.g.,magnetic, magneto optical disks, or optical disks. However, a computerneed not have such devices. Computer readable media suitable for storingcomputer program instructions and data include all forms of non-volatilememory, media and memory devices, including by way of examplesemiconductor memory devices, e.g., EPROM, EEPROM, and flash memorydevices; magnetic disks, e.g., internal hard disks or removable disks;magneto optical disks; and CD ROM and DVD-ROM disks. The processor andthe memory can be supplemented by, or incorporated in, special purposelogic circuitry.

While this patent document contains many specifics, these should not beconstrued as limitations on the scope of any subject matter or of whatmay be claimed, but rather as descriptions of features that may bespecific to particular embodiments of particular techniques. Certainfeatures that are described in this patent document in the context ofseparate embodiments can also be implemented in combination in a singleembodiment. Conversely, various features that are described in thecontext of a single embodiment can also be implemented in multipleembodiments separately or in any suitable subcombination. Moreover,although features may be described above as acting in certaincombinations and even initially claimed as such, one or more featuresfrom a claimed combination can in some cases be excised from thecombination, and the claimed combination may be directed to asubcombination or variation of a subcombination.

Similarly, while operations are depicted in the drawings in a particularorder, this should not be understood as requiring that such operationsbe performed in the particular order shown or in sequential order, orthat all illustrated operations be performed, to achieve desirableresults. Moreover, the separation of various system components in theembodiments described in this patent document should not be understoodas requiring such separation in all embodiments.

Only a few implementations and examples are described and otherimplementations, enhancements and variations can be made based on whatis described and illustrated in this patent document.

What is claimed is:
 1. A method for video processing, comprising:applying, for a conversion between a current block in a video coded witha multiple motion models based skip or direct mode and a bitstream ofthe video including a candidate index for the current block, a pruningoperation between a first motion candidate derived using a history-basedmotion vector prediction (HMVP) motion model and a second motioncandidate derived using a first motion model; and performing theconversion based on a result of the pruning operation; wherein eachmotion model of the multiple motion models corresponds to one ormultiple motion candidates derived from a same rule and the multiplemotion models include at least one HMVP motion model that derived amotion candidate from an HMVP table, and at least one first motion modelincluding at least one of: a motion model that derives a motioncandidate from a picture other than a current picture, or a motion modelthat derives a motion candidate from spatial adjacent blocks of a block,and the candidate index indicates that the HMVP motion model is used forthe current block, wherein the result of the pruning operation indicatesusing the first motion candidate for the conversion and excluding thesecond motion candidate, wherein the HMVP table includes a set of motioncandidates, each of which is associated with a corresponding motioninformation and is derived from a previous video block, and wherein anarrangement of the set of motion candidates in the HMVP table is basedon a decoding order or an encoding order of the previous video block,and wherein the pruning operation is not applied between second motioncandidates.
 2. The method of claim 1, wherein the first motion candidateis identical to the second motion candidate.
 3. The method of claim 1,wherein a motion vector difference between the first motion candidateand the second motion candidate is equal to or less than a threshold. 4.The method of claim 1, wherein the second motion candidate is derivedusing one of a motion model-matched search, an artificial search or adefault motion vector construction process.
 5. The method of claim 1,wherein performing the conversion comprises generating the bitstreamfrom the current block.
 6. The method of claim 1, wherein performing theconversion comprises generating the current block from the bitstream. 7.The method of claim 1, wherein the first motion candidate is associatedwith motion information comprising at least one of a predictiondirection, a reference picture index, a motion vector value, anintensity compensation flag, an affine flag, a motion vector differenceprecision or motion vector difference value.
 8. The method of claim 1,further comprising: updating, subsequent to performing the conversion,the HMVP table based on motion information of the current block.
 9. Themethod of claim 8, further comprising: performing, subsequent toupdating the HMVP table, a conversion between a subsequent video blockof the video and the bitstream of the video based on the HMVP table. 10.An apparatus for processing video data comprising a processor and anon-transitory memory with instructions thereon, wherein theinstructions upon execution by the processor, cause the processor to:apply, for a conversion between a current block in a video coded with amultiple motion models based skip or direct mode and a bitstream of thevideo including a candidate index for the current block, a pruningoperation between a first motion candidate derived using a history-basedmotion vector prediction (HMVP) motion model and a second motioncandidate derived using a first motion model; and perform the conversionbased on a result of the pruning operation; wherein each motion model ofthe multiple motion models corresponds to one or multiple motioncandidates derived from a same rule and the multiple motion modelsinclude at least one HMVP motion model that derived a motion candidatefrom an HMVP table, and at least one first motion model including atleast one of: a motion model that derives a motion candidate from apicture other than a current picture, or a motion model that derives amotion candidate from spatial adjacent blocks of a block, and thecandidate index indicates that the HMVP motion model is used for thecurrent block, wherein the result of the pruning operation indicatesusing the first motion candidate for the conversion and excluding thesecond motion candidate, wherein the HMVP table includes a set of motioncandidates, each of which is associated with a corresponding motioninformation and is derived from a previous video block, and wherein anarrangement of the set of motion candidates in the HMVP table is basedon a decoding order or an encoding order of the previous video block,and wherein the pruning operation is not applied between second motioncandidates.
 11. The apparatus of claim 10, wherein the first motioncandidate is identical to the second motion candidate.
 12. The apparatusof claim 10, wherein a motion vector difference between the first motioncandidate and the second motion candidate is equal to or less than athreshold.
 13. The apparatus of claim 10, wherein the second motioncandidate is derived using one of a motion model-matched search, anartificial search or a default motion vector construction process.
 14. Anon-transitory computer-readable storage medium storing instructionsthat cause a processor to: apply, for a conversion between a currentblock in a video coded with a multiple motion models based skip ordirect mode and a bitstream of the video including a candidate index forthe current block, a pruning operation between a first motion candidatederived using a history-based motion vector prediction (HMVP) motionmodel and a second motion candidate derived using a first motion model;and perform the conversion based on a result of the pruning operation;wherein each motion model of the multiple motion models corresponds toone or multiple motion candidates derived from a same rule and themultiple motion models include at least one HMVP motion model thatderived a motion candidate from an HMVP table, and at least one firstmotion model including at least one of: a motion model that derives amotion candidate from a picture other than a current picture, or amotion model that derives a motion candidate from spatial adjacentblocks of a block, and the candidate index indicates that the HMVPmotion model is used for the current block, wherein the result of thepruning operation indicates using the first motion candidate for theconversion and excluding the second motion candidate, wherein the HMVPtable includes a set of motion candidates, each of which is associatedwith a corresponding motion information and is derived from a previousvideo block, and wherein an arrangement of the set of motion candidatesin the HMVP table is based on a decoding order or an encoding order ofthe previous video block, and wherein the pruning operation is notapplied between second motion candidates.
 15. The non-transitorycomputer-readable storage medium of claim 14, wherein the first motioncandidate is identical to the second motion candidate.
 16. Thenon-transitory computer-readable storage medium of claim 14, wherein amotion vector difference between the first motion candidate and thesecond motion candidate is equal to or less than a threshold.
 17. Thenon-transitory computer-readable storage medium of claim 14, wherein thesecond motion candidate is derived using one of a motion model-matchedsearch, an artificial search or a default motion vector constructionprocess.
 18. A non-transitory computer-readable recording medium storinga bitstream which is generated by a method performed by a videoprocessing apparatus, wherein the method comprises: applying, for acurrent block in a video coded with a multiple motion models based skipor direct mode a pruning operation between a first motion candidatederived using a history-based motion vector prediction (HMVP) motionmodel and a second motion candidate derived using a first motion model;and generating the bitstream from the current block based on a result ofthe pruning operation; wherein each motion model of the multiple motionmodels corresponds to one or multiple motion candidates derived from asame rule and the multiple motion models include at least one HMVPmotion model that derives a motion candidate from an HMVP table, and atleast one first motion model including at least one of: a motion modelthat derives a motion candidate from a picture other than a currentpicture, or a motion model that derives a motion candidate from spatialadjacent blocks of a block, and a candidate index for the current blockindicates that the HMVP motion model is used for the current block,wherein the result of the pruning operation indicating using the firstmotion candidate for the generating and excluding the second motioncandidate, and wherein the HMVP table includes a set of motioncandidates, each of which is associated with a corresponding motioninformation and is derived from a previous video block, and wherein anarrangement of the set of motion candidates in the HMVP table is basedon a decoding order or an encoding order of the previous video block,and wherein the pruning operation is not applied between second motioncandidates.
 19. The non-transitory computer-readable recording medium ofclaim 18, wherein the first motion candidate is identical to the secondmotion candidate.
 20. The non-transitory computer-readable recordingmedium of claim 18, wherein a motion vector difference between the firstmotion candidate and the second motion candidate is equal to or lessthan a threshold.